Parallel computations for Yau filters
نویسندگان
چکیده
منابع مشابه
Evaluating Parallel Languages for Molecular Dynamics Computations Evaluating Parallel Languages for Molecular Dynamics Computations
Computational molecular dynamics is an important application requiring large amounts of computing time. Parallel processing ooers very high performance potential , but irregular problems like molecular dynamics have proven diicult to map onto parallel machines. In this paper, we describe the practicalities of porting a basic molecular dynamics computation to a distributed-memory machine. In the...
متن کاملParallel Matrix Computations
In this article we develop some algorithms and tools for solving matrix problems on parallel processing computers. Operations are synchronized through data-flow alone, which makes global synchronization unnecessary and enables the algorithms to be implemented on machines with very simple operating systems and communication protocols. As examples, zve present algorithms that form the main module...
متن کاملDynamic Hypercubic Parallel Computations
Though there have been substantial progress, the current status of parallel computing is still inmature. No single model of parallel computation has yet come to dominate developments in parallel computing in the way that the von Neumann model has dominated sequential computing. The design of parallel programs requires fancy solutions that are not present in sequential programming. There are spe...
متن کاملInherently Parallel Computations
The term inherently parallel computation refers to a computation that can be performed successfully only on a parallel computer with an appropriate number of processors. Examples are computations that involve: time-varying variables, time-varying complexity, rank-varying complexity, interacting variables, uncertain time constraints, and variables obeying mathematical constraints. These computat...
متن کاملOn Parallel CRC Computations
We propose a recursive formula for computing the remainder of a Euclidean division of polynomials (with binary coefficients), which operates in parallel on w bits at a time and takes t new incoming bits at each stage. We use this formula to design a fast parallel Cyclic Redundancy Check (CRC) system which is a look-ahead scheme that trades in arbitrary depth (processing time per cycle) and thro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2005
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2005.01.026